Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
221	Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes NP-complete problems Bin packing problem Approximation algorithms Discrete geometry Packing problem Polynomial-time approximation scheme Time complexity Bin Theoretical computer science Computational complexity theory Applied mathematics
222	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Bin packing problem Approximation algorithm Polynomial-time approximation scheme Subset sum problem NP PP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
223	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Operations research Bin packing problem Approximation algorithm Job shop scheduling Greedy algorithm Algorithm Theoretical computer science Mathematics Applied mathematics
224	Data Locality Problems and Colored Bin Packing Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil) May 11, 2009 Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil) Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:11 Operations research Job shop scheduling Campinas Approximation algorithm Bin Theoretical computer science Applied mathematics Bin packing problem
225	Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Dynamic programming Subset sum problem Bin packing problem Approximation algorithm Complexity classes Combinatorial optimization NP Partition problem Theoretical computer science Computational complexity theory Applied mathematics
226	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2009-03-25 10:41:58 NP-complete problems Network theory Vertex cover Steiner tree problem Shortest path problem Linear programming SL Edge disjoint shortest pair algorithm Pseudoforest Theoretical computer science Graph theory Mathematics
227	How to find the best approximation results – a follow-up to Garey and Johnson∗ Pierluigi Crescenzi† Viggo Kann‡ Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 1998-12-21 18:16:27 Complexity classes Mathematical optimization NP-complete problems Combinatorial optimization Approximation algorithm NP-complete Hardness of approximation Optimization problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
228	An Algorithm for Affine Approximation of Binary Decision Diagrams Kevin Henshall∗ Peter Schachte∗ Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-03 17:31:41 Artificial neuron Tiny Encryption Algorithm Complete Boolean algebra FO Applied mathematics Boolean algebra Mathematics Boolean function
229	An Algorithm for Affine Approximation of Binary Decision Diagrams Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-02 16:47:00 Complete Boolean algebra Affine space FO Boolean algebra Mathematics Boolean function
230	Constant-Time Testing and Learning of Image Properties (full version) arXiv:1503.01363v2 [cs.DS] 6 MarPiotr Berman∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-08 21:15:52 Analysis of algorithms Computational complexity theory Approximation algorithms Property testing Time complexity Algorithm Randomized algorithm Theoretical computer science Applied mathematics Mathematics

UPDATE